Regular Expressions for Muller Context-Free Languages
نویسندگان
چکیده
منابع مشابه
Regular Expressions for Muller Context-Free Languages
Muller context-free languages (MCFLs) are languages of countable words, that is, labeled countable linear orders, generated by Muller context-free grammars. Equivalently, they are the frontier languages of (nondeterministic Muller-)regular languages of infinite trees. In this article we survey the known results regarding MCFLs, and show that a language is an MCFL if and only if it can be genera...
متن کاملRegular Expressions and Context-Free Grammars for Picture Languages
We introduce a new concept of regular expression and context-free grammar for picture languages (sets of matrices over a nite alphabet) and compare and connect these two formalisms.
متن کاملRegular patterns, regular languages and context-free languages
In this paper we consider two questions. First we consider whether every pattern language which is regular can be generated by a regular pattern. We show that this is indeed the case for extended (erasing) pattern languages if alphabet size is at least four. In all other cases, we show that there are patterns generating a regular language which cannot be generated by a regular pattern. Next we ...
متن کاملRegular Realizability Problems and Context-Free Languages
We investigate regular realizability (RR) problems, which are the problems of verifying whether the intersection of a regular language – the input of the problem – and a fixed language, called a filter, is non-empty. In this paper we focus on the case of context-free filters. The algorithmic complexity of the RR problem is a very coarse measure of the complexity of context-free languages. This ...
متن کاملRegular Description of Context-Free Graph Languages
A set of (labeled) graphs can be de ned by a regular tree language and one regular string language for each possible edge label, as follows. For each tree t from the regular tree language the graph gr(t) has the same nodes as t (with the same labels), and there is an edge with label from node x to node y if the string of labels of the nodes on the shortest path from x to y in t belongs to the r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Cybernetica
سال: 2017
ISSN: 0324-721X
DOI: 10.14232/actacyb.23.1.2017.19